High-Order Iterative Methods Repeating Roots a Constructive Recapitulation

نویسندگان

چکیده

This paper considers practical, high-order methods for the iterative location of roots nonlinear equations, one at a time. Special attention is being paid to algorithms also applicable multiple initially known and unknown multiplicity. Efficient are presented in this note evaluation multiplicity index root sought. Also reviewed here super-linear super-cubic that converge contrarily or alternatingly, enabling us, not only approach briskly confidently but actually bound bracket it as we progress.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Iterative Roots with Second Order Training Methods

Iterative roots are a valuable tool for modeling and analyzing dynamical systems. They provide a natural way to construct a continuous time model from discrete time data. However, they are in most cases extremely difficult to compute analytically. Previously we have demonstrated how to use neural networks to calculate the iterative roots and fractional iterations of functions. We used a special...

متن کامل

THIRD-ORDER AND FOURTH-ORDER ITERATIVE METHODS FREE FROM SECOND DERIVATIVE FOR FINDING MULTIPLE ROOTS OF NONLINEAR EQUATIONS

In this paper, we present two new families of third-order and fourth-order methods for finding multiple roots of nonlinear equations. Each of them requires one evaluation of the function and two of its first derivative per iteration. Several numerical examples are given to illustrate the performance of the presented methods.    

متن کامل

third-order and fourth-order iterative methods free from second derivative for finding multiple roots of nonlinear equations

in this paper, we present two new families of third-order and fourth-order methods for finding multiple roots of nonlinear equations. each of them requires one evaluation of the function and two of its first derivative per iteration. several numerical examples are given to illustrate the performance of the presented methods.

متن کامل

Root finding by high order iterative methods based on quadratures

We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with n+ 1 nodes is used the resulting iterative method has convergence order at least n+ 2, starting with the case n = 0 (which corresponds to the Newton’s method).

متن کامل

A Comparison of Different Neural Methods for Solving Iterative Roots

Finding iterative roots is the inverse problem of iteration. Iteration itself plays a major role in numerous theories and applications. So far it is hardly realized how many problems can be related to its counterpart. This may be due to the difficulty of the mathematics involved: There are no standard methods available for computing these fractional iterations. Previously we have shown how neur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied mathematics

سال: 2022

ISSN: ['2152-7393', '2152-7385']

DOI: https://doi.org/10.4236/am.2022.132011